TSTP Solution File: ITP238^3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP238^3 : TPTP v8.2.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:17:20 EDT 2024

% Result   : Theorem 54.54s 14.80s
% Output   : CNFRefutation 54.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   41 (  13 unt;  22 typ;   0 def)
%            Number of atoms       :   25 (  18 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   98 (  11   ~;   4   |;   0   &;  81   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   19 (  17 usr;   9 con; 0-2 aty)
%            Number of variables   :    8 (   0   ^   8   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    nat: $tType ).

thf(decl_sort2,type,
    num: $tType ).

thf(decl_sort3,type,
    option_nat: $tType ).

thf(decl_sort4,type,
    vEBT_VEBT: $tType ).

thf(decl_sort5,type,
    list_VEBT_VEBT: $tType ).

thf(decl_245,type,
    one_one_nat: nat ).

thf(decl_423,type,
    nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).

thf(decl_452,type,
    suc: nat > nat ).

thf(decl_519,type,
    bit0: num > num ).

thf(decl_521,type,
    one: num ).

thf(decl_529,type,
    numeral_numeral_nat: num > nat ).

thf(decl_535,type,
    none_nat: option_nat ).

thf(decl_538,type,
    some_nat: nat > option_nat ).

thf(decl_761,type,
    divide_divide_nat: nat > nat > nat ).

thf(decl_910,type,
    vEBT_VEBT_high: nat > nat > nat ).

thf(decl_947,type,
    vEBT_vebt_mint: vEBT_VEBT > option_nat ).

thf(decl_988,type,
    deg: nat ).

thf(decl_992,type,
    na: nat ).

thf(decl_994,type,
    thesis: $o ).

thf(decl_995,type,
    treeList: list_VEBT_VEBT ).

thf(decl_996,type,
    xa: nat ).

thf(decl_1013,type,
    esk13_1: option_nat > nat ).

thf(conj_0,hypothesis,
    ! [X20450: nat] :
      ( ( ( vEBT_vebt_mint @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) )
        = ( some_nat @ X20450 ) )
     => thesis ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

thf(fact_1__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).

thf(fact_1123_Suc__1,axiom,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1123_Suc__1) ).

thf(conj_1,conjecture,
    thesis,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

thf(fact_85_option_Oexhaust,axiom,
    ! [X125: option_nat] :
      ( ( X125 != none_nat )
     => ~ ! [X126: nat] :
            ( X125
           != ( some_nat @ X126 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_85_option_Oexhaust) ).

thf(fact_0_False,axiom,
    ( ( vEBT_vebt_mint @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) )
   != none_nat ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_False) ).

thf(c_0_6,hypothesis,
    ! [X29615: nat] :
      ( ( ( vEBT_vebt_mint @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) )
       != ( some_nat @ X29615 ) )
      | thesis ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])]) ).

thf(c_0_7,plain,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    inference(split_conjunct,[status(thm)],[fact_1__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).

thf(c_0_8,plain,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    inference(split_conjunct,[status(thm)],[fact_1123_Suc__1]) ).

thf(c_0_9,negated_conjecture,
    ~ thesis,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).

thf(c_0_10,hypothesis,
    ! [X3: nat] :
      ( thesis
      | ( ( vEBT_vebt_mint @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) )
       != ( some_nat @ X3 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_11,plain,
    ( ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) )
    = na ),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_12,negated_conjecture,
    ~ thesis,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_13,plain,
    ! [X29651: option_nat] :
      ( ( X29651 = none_nat )
      | ( X29651
        = ( some_nat @ ( esk13_1 @ X29651 ) ) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_85_option_Oexhaust])])]) ).

thf(c_0_14,plain,
    ( ( vEBT_vebt_mint @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) )
   != none_nat ),
    inference(split_conjunct,[status(thm)],[fact_0_False]) ).

thf(c_0_15,hypothesis,
    ! [X3: nat] :
      ( ( vEBT_vebt_mint @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) )
     != ( some_nat @ X3 ) ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8]),c_0_11]),c_0_12]) ).

thf(c_0_16,plain,
    ! [X22: option_nat] :
      ( ( X22 = none_nat )
      | ( X22
        = ( some_nat @ ( esk13_1 @ X22 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_17,plain,
    ( ( vEBT_vebt_mint @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) )
   != none_nat ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_8]),c_0_11]) ).

thf(c_0_18,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : ITP238^3 : TPTP v8.2.0. Released v8.1.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n026.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sat May 18 16:59:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.48  Running higher-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 54.54/14.80  # Version: 3.1.0-ho
% 54.54/14.80  # partial match(1): HMLMSMSMSSLCHFA
% 54.54/14.80  # Preprocessing class: HMLMSMLMSSLCHFA.
% 54.54/14.80  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.54/14.80  # Starting new_ho_10 with 1500s (5) cores
% 54.54/14.80  # Starting sh5l with 300s (1) cores
% 54.54/14.80  # Starting new_bool_1 with 300s (1) cores
% 54.54/14.80  # Starting new_bool_2 with 300s (1) cores
% 54.54/14.80  # new_bool_2 with pid 6601 completed with status 0
% 54.54/14.80  # Result found by new_bool_2
% 54.54/14.80  # partial match(1): HMLMSMSMSSLCHFA
% 54.54/14.80  # Preprocessing class: HMLMSMLMSSLCHFA.
% 54.54/14.80  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.54/14.80  # Starting new_ho_10 with 1500s (5) cores
% 54.54/14.80  # Starting sh5l with 300s (1) cores
% 54.54/14.80  # Starting new_bool_1 with 300s (1) cores
% 54.54/14.80  # Starting new_bool_2 with 300s (1) cores
% 54.54/14.80  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 54.54/14.80  # Search class: HGHSM-SMLM32-DHFFFFBN
% 54.54/14.80  # partial match(1): HGHSM-SMLM32-DHFFFSBN
% 54.54/14.80  # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 54.54/14.80  # Starting new_ho_10 with 180s (1) cores
% 54.54/14.80  # new_ho_10 with pid 6731 completed with status 0
% 54.54/14.80  # Result found by new_ho_10
% 54.54/14.80  # partial match(1): HMLMSMSMSSLCHFA
% 54.54/14.80  # Preprocessing class: HMLMSMLMSSLCHFA.
% 54.54/14.80  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 54.54/14.80  # Starting new_ho_10 with 1500s (5) cores
% 54.54/14.80  # Starting sh5l with 300s (1) cores
% 54.54/14.80  # Starting new_bool_1 with 300s (1) cores
% 54.54/14.80  # Starting new_bool_2 with 300s (1) cores
% 54.54/14.80  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 54.54/14.80  # Search class: HGHSM-SMLM32-DHFFFFBN
% 54.54/14.80  # partial match(1): HGHSM-SMLM32-DHFFFSBN
% 54.54/14.80  # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 54.54/14.80  # Starting new_ho_10 with 180s (1) cores
% 54.54/14.80  # Preprocessing time       : 0.206 s
% 54.54/14.80  # Presaturation interreduction done
% 54.54/14.80  
% 54.54/14.80  # Proof found!
% 54.54/14.80  # SZS status Theorem
% 54.54/14.80  # SZS output start CNFRefutation
% See solution above
% 54.54/14.80  # Parsed axioms                        : 11333
% 54.54/14.80  # Removed by relevancy pruning/SinE    : 7325
% 54.54/14.80  # Initial clauses                      : 11261
% 54.54/14.80  # Removed in clause preprocessing      : 2093
% 54.54/14.80  # Initial clauses in saturation        : 9168
% 54.54/14.80  # Processed clauses                    : 12584
% 54.54/14.80  # ...of these trivial                  : 363
% 54.54/14.80  # ...subsumed                          : 3377
% 54.54/14.80  # ...remaining for further processing  : 8844
% 54.54/14.80  # Other redundant clauses eliminated   : 3031
% 54.54/14.80  # Clauses deleted for lack of memory   : 0
% 54.54/14.80  # Backward-subsumed                    : 35
% 54.54/14.80  # Backward-rewritten                   : 90
% 54.54/14.80  # Generated clauses                    : 4457
% 54.54/14.80  # ...of the previous two non-redundant : 3447
% 54.54/14.80  # ...aggressively subsumed             : 0
% 54.54/14.80  # Contextual simplify-reflections      : 127
% 54.54/14.80  # Paramodulations                      : 1670
% 54.54/14.80  # Factorizations                       : 0
% 54.54/14.80  # NegExts                              : 0
% 54.54/14.80  # Equation resolutions                 : 3046
% 54.54/14.80  # Disequality decompositions           : 0
% 54.54/14.80  # Total rewrite steps                  : 20202
% 54.54/14.80  # ...of those cached                   : 19282
% 54.54/14.80  # Propositional unsat checks           : 0
% 54.54/14.80  #    Propositional check models        : 0
% 54.54/14.80  #    Propositional check unsatisfiable : 0
% 54.54/14.80  #    Propositional clauses             : 0
% 54.54/14.80  #    Propositional clauses after purity: 0
% 54.54/14.80  #    Propositional unsat core size     : 0
% 54.54/14.80  #    Propositional preprocessing time  : 0.000
% 54.54/14.80  #    Propositional encoding time       : 0.000
% 54.54/14.80  #    Propositional solver time         : 0.000
% 54.54/14.80  #    Success case prop preproc time    : 0.000
% 54.54/14.80  #    Success case prop encoding time   : 0.000
% 54.54/14.80  #    Success case prop solver time     : 0.000
% 54.54/14.80  # Current number of processed clauses  : 861
% 54.54/14.80  #    Positive orientable unit clauses  : 369
% 54.54/14.80  #    Positive unorientable unit clauses: 0
% 54.54/14.80  #    Negative unit clauses             : 206
% 54.54/14.80  #    Non-unit-clauses                  : 286
% 54.54/14.80  # Current number of unprocessed clauses: 5296
% 54.54/14.80  # ...number of literals in the above   : 18771
% 54.54/14.80  # Current number of archived formulas  : 0
% 54.54/14.80  # Current number of archived clauses   : 5400
% 54.54/14.80  # Clause-clause subsumption calls (NU) : 25568577
% 54.54/14.80  # Rec. Clause-clause subsumption calls : 1364329
% 54.54/14.80  # Non-unit clause-clause subsumptions  : 3042
% 54.54/14.80  # Unit Clause-clause subsumption calls : 50916
% 54.54/14.80  # Rewrite failures with RHS unbound    : 0
% 54.54/14.80  # BW rewrite match attempts            : 1056
% 54.54/14.80  # BW rewrite match successes           : 260
% 54.54/14.80  # Condensation attempts                : 12584
% 54.54/14.80  # Condensation successes               : 36
% 54.54/14.80  # Termbank termtop insertions          : 3252313
% 54.54/14.80  # Search garbage collected termcells   : 200495
% 54.54/14.80  
% 54.54/14.80  # -------------------------------------------------
% 54.54/14.80  # User time                : 13.150 s
% 54.54/14.80  # System time              : 0.134 s
% 54.54/14.80  # Total time               : 13.284 s
% 54.54/14.80  # Maximum resident set size: 51836 pages
% 54.54/14.80  
% 54.54/14.80  # -------------------------------------------------
% 54.54/14.80  # User time                : 14.025 s
% 54.54/14.80  # System time              : 0.166 s
% 54.54/14.80  # Total time               : 14.191 s
% 54.54/14.80  # Maximum resident set size: 27920 pages
% 54.54/14.80  % E---3.1 exiting
% 54.54/14.80  % E exiting
%------------------------------------------------------------------------------